Conditional rewriting logic as a unified model of concurrency

Translating Logic Programs into Conditional Rewriting Systems

In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is deened. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. programming: transforming logic programs to lazy fu...

Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report

This paper surveys the work of many researchers on rewriting logic since it was rst introduced in 1990. The main emphasis is on the use of rewriting logic as a semantic framework for concurrency. The goal in this regard is to express as faithfully as possible a very wide range of concurrency models, each on its own terms, avoiding any encodings or translations. Bringing very diierent models und...

Rewriting as a Unified Specification Tool for Logic and Control: The ELAN Language

We introduce computational systems to formalise the notion of rewriting directed by user defined strategies. This provides a semantics for ELAN, an environment dedicated to prototype, experiment and study the combination of different deduction systems for constraint solving, theorem proving and logic programming paradigms. Formally, a computational system can be represented as a rewrite theory ...

Conditional Narrowing Modulo in Rewriting Logic and Maude

This work studies the relationship between verifiable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. These problems have the form (∃x̄)s(x̄) →∗ t(x̄), with x̄ some variables, or a conjunction of several of these subgoals. A calculus that solves this kind of problems has been developed and proved correct. Given a reachability prob...

Towards a unified language based on equational logic, rewriting logic, and type theory